Lattice Magnetic Walks
نویسنده
چکیده
Sums of walks for charged particles (e.g. Hofstadter electrons) on a square lattice in the presence of a magnetic field are evaluated. Returning loops are systematically added to directed paths to obtain the unrestricted propagators. Expressions are obtained for special values of the magnetic flux-per-plaquette commensurate with the flux quantum. For commensurate and incommensurate values of the flux, the addition of small returning loops does not affect the general features found earlier for directed paths. Lattice Green’s functions are also obtained for staggered flux configurations encountered in models of high-Tc superconductors.
منابع مشابه
Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
We study self-avoiding and neighbour-avoiding walks and lattice trails on two semiregular lattices, the (3.122) lattice and the (4.82) lattice. For the (3.122) lattice we find the exact connective constant for both self-avoiding walks, neighbour-avoiding walks and trails. For the (4.82) lattice we generate long series which permit the accurate estimation of the connective constant for self-avoi...
متن کاملSelf-avoiding walks and trails on the 3.12 lattice
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کامل1 1 O ct 2 00 4 Self - avoiding walks and trails on the 3 . 12 2 lattice Anthony
We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the 3.122 lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the hexagonal lattice. Since the growth constant for these graphs is known on the hexagonal lattice we can find the growth constant for both walks and trails on the ...
متن کاملar X iv : c on d - m at / 9 40 80 97 v 1 3 1 A ug 1 99 4 Lattice Green Function ( at 0 ) for the 4 d Hypercubic Lattice
The generating function for recurrent Polya walks on the four dimensional hypercubic lattice is expressed as a Kampé-de-Fériet function. Various properties of the associated walks are enumerated. Lattice statistics play an important role in many areas of chemistry and statistical physics. Random lattice walks have been investigated extensively, both numerically and analytically, and explicit an...
متن کامل